An Improved Genetic Algorithm for Attribute Reduction in Rough Set Theory

نویسندگان

  • Changsheng Zhang
  • Jing Ruan
  • Huasheng Zou
چکیده

Since attribute reduction is NP-hard problem, in order to obtain the minimum relative reduction effectively in decision table, an attribute reduction algorithm in rough set theory based on improved genetic algorithm is proposed. At first, the dependence concept of decision attribute on condition attribute is introduced. At the same time, the relative importance of the condition attribute with respect to decision attribute is defined. On the basis of these conditions , a relative core is computed based on attribute significance as heuristic information, which adds to the initial population so that the evolution of chromosomes is guided. What's more, the control factor is introduced in an appropriate function to ensure the stronger distinction ability. Therefore, the proposed appropriate function can reduce the computing time to obtain the best search results. To evaluate our proposed algorithm, a numerical experiment is carried out on the Zoo dataset at last. The results demonstrate that the proposed algorithm can obtain the attribute reduction more effectively than the existing algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Attribute Reduction Algorithm Based on Rough Set Theory and an Improved Genetic Algorithm

Because the existing attribute reduction algorithms based on rough set theory and genetic algorithm have the main problems: the complexity in calculating fitness function and slow speed in convergence. An attribute reduction algorithm based on rough set theory and an improved genetic algorithm is proposed in this paper. In order to simplify the calculation of fitness function under the conditio...

متن کامل

Attribute Reduction Based on the Rough Set Theory

36 www.ijeas.org  Abstract—The genetic algorithm is used to optimize the algorithm of attribute reduction in data preprocessing, and the rough approximation precision in the rough set theory is utilized to determine the importance of information attribute. From which the decision table is constituted by selecting the attributes which have higher degree of attribute importance, and the attribut...

متن کامل

An Improved Heuristic Attribute Reduction Algorithm Based on Informa- tion Entropy in Rough Set

At present, in rough set theory there are two kinds of heuristic attribute reduction algorithms, one is based on discernibility matrix, the other is based on mutual information. But if these algorithms are applied to the non-core information system, there will be much problems, such as too much calculation, excessive reduction, or insufficient reduction. So we propose an improved heuristic attr...

متن کامل

Reduction of DEA-Performance Factors Using Rough Set Theory: An Application of Companies in the Iranian Stock Exchange

he financial management field has witnessed significant developments in recent years to help decision makers, managers and investors, to made optimal decisions. In this regard, the institutions investment strategies and their evaluation methods continuously change with the rapid transfer of information and access to the fi- nancial data. When information is available ...

متن کامل

Ant Colony Optimization based Feature Selection in Rough Set Theory

Feature selection is an important concept in rough set theory; it aims to determine a minimal subset of features that are jointly sufficient for preserving a particular property of the original data. This paper proposes an attribute reduction method that is based on Ant Colony Optimization algorithm and rough set theory as an evaluation measurement. The proposed method was tested on standard be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011